Robust Feature Bundling
نویسندگان
چکیده
In this work we present a feature bundling technique that aggregates individual local features with features from their spatial neighborhood into bundles. The resulting bundles carry more information of the underlying image content than single visual words. As in practice an exact search for such bundles is infeasible, we employ a robust approximate similarity search with min-hashing in order to retrieve images containing similar bundles. We demonstrate the benefits of these bundles for small object retrieval, i.e. logo recognition, and generic image retrieval. Multiple bundling strategies are explored and thoroughly evaluated on three different datasets.
منابع مشابه
Feature Transformation Methods in Data Mining
The quality of knowledge extracted from a data set can be enhanced by its transformation. Discretization and filling missing data are the most common forms of data transformation. A new transformation method named feature bundling is introduced. A feature bundle involves a set of features in its pure or transformed form. The computational results reported in this paper show that the classificat...
متن کاملDynamic Bundling: Less Effort for More Solutions
Bundling of the values of variables in a Constraint Satisfaction Problem (CSP) as the search proceeds is an abstraction mechanism that yields a compact representation of the solution space. We have previously established that, in spite of the effort of recomputing the bundles, dynamic bundling is never less effective than static bundling and nonbundling search strategies. Objections were raised...
متن کاملPlease Do not Circulate—Preliminary and Incomplete Mixed Bundling and Imperfect Competition
A model of two-product, Hotelling duopolists is examined in which firms can engage in mixed bundling. Even though products are independent in consumption, bundled pricing induces complementarity across different products. The most efficient outcome, symmetric independent goods pricing, is no longer an equilibrium when mixed bundling is feasible. On the other hand, inefficient pure bundling equi...
متن کاملDPML-Risk: An Efficient Algorithm for Image Registration
Targets and objects registration and tracking in a sequence of images play an important role in various areas. One of the methods in image registration is feature-based algorithm which is accomplished in two steps. The first step includes finding features of sensed and reference images. In this step, a scale space is used to reduce the sensitivity of detected features to the scale changes. Afterw...
متن کاملConstraint Processing Techniques for Improving Join Computation: A Proof of Concept
Constraint Processing and Database techniques overlap significantly. We discuss here the application of a constraint satisfaction technique, called dynamic bundling, to databases. We model the join query computation as a Constraint Satisfaction Problem (CSP) and solve it by search using dynamic bundling. First, we introduce a sort-based technique for computing dynamic bundling. Then, we describ...
متن کامل